Search results for "string [quantum chromodynamics]"

showing 10 items of 166 documents

IP6K gene identification in plant cells via tag discovery

2010

Bioinformatics Motif extraction String analysis
researchProduct

IP6K gene identification in plant genomes by tag searching

2011

Abstract Background Plants have played a special role in inositol polyphosphate (IP) research since in plant seeds was discovered the first IP, the fully phosphorylated inositol ring of phytic acid (IP6). It is now known that phytic acid is further metabolized by the IP6 Kinases (IP6Ks) to generate IP containing pyro-phosphate moiety. The IP6K are evolutionary conserved enzymes identified in several mammalian, fungi and amoebae species. Although IP6K has not yet been identified in plant chromosomes, there are many clues suggesting its presences in vegetal cells. Results In this paper we propose a new approach to search for the plant IP6K gene, that lead to the identification in plant genome…

Bioinformatics Motif extraction String analysisGeneticsMitochondrial DNAOryza sativaNuclear genebiologyNucleic acid sequencefood and beveragesChromosomeGeneral Medicinebiology.organism_classificationGenomeGeneral Biochemistry Genetics and Molecular BiologyProceedingsArabidopsis thalianaGeneBMC Proceedings
researchProduct

Pattern Discovery In Biosequences: From Simple To Complex Patterns

2007

Bioinformatics Pattern Discovery String Analysis
researchProduct

Adding symbolic information to picture models: definitions and properties

2005

AbstractIn the paper we propose extensions of some picture models, such as colored, drawn and pixel pictures. Such extensions are conceived by observing that a picture may embed more information than the shape, such as colors, labels, etc., which can be represented by a symbol from an alphabet and can be associated to segments, points or pixels. New interesting issues derived from the introduction of symbols will be investigated together with some complexity and decidability questions for the proposed extensions.

Chain codeChain code pictures; Picture languages; String descriptions; Decidability problemsTheoretical computer scienceGeneral Computer ScienceComputer scienceComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONPicture languagesString descriptionsPicture languageSymbol (chemistry)DecidabilityTheoretical Computer ScienceChain code picturesDecidability problemsAlphabetAlgorithmComputer Science(all)Theoretical Computer Science
researchProduct

Languages with mismatches

2007

AbstractIn this paper we study some combinatorial properties of a class of languages that represent sets of words occurring in a text S up to some errors. More precisely, we consider sets of words that occur in a text S with k mismatches in any window of size r. The study of this class of languages mainly focuses both on a parameter, called repetition index, and on the set of the minimal forbidden words of the language of factors of S with errors. The repetition index of a string S is defined as the smallest integer such that all strings of this length occur at most in a unique position of the text S up to errors. We prove that there is a strong relation between the repetition index of S an…

Combinatorics on wordsApproximate string matchingGeneral Computer ScienceRepetition (rhetorical device)String (computer science)Search engine indexingComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Approximate string matchingData structureTheoretical Computer ScienceCombinatoricsSet (abstract data type)Formal languagesCombinatorics on words Formal languages Approximate string matching IndexingIndexingWord (group theory)MathematicsInteger (computer science)Computer Science(all)Theoretical Computer Science
researchProduct

"Indexing structures for approximate string matching

2003

In this paper we give the first, to our knowledge, structures and corresponding algorithms for approximate indexing, by considering the Hamming distance, having the following properties. i) Their size is linear times a polylog of the size of the text on average. ii) For each pattern x, the time spent by our algorithms for finding the list occ(x) of all occurrences of a pattern x in the text, up to a certain distance, is proportional on average to |x| + |occ(x)|, under an additional but realistic hypothesis.

CombinatoricsCombinatorics on wordsPattern recognition (psychology)Search engine indexingAutomata theoryHamming distanceString searching algorithmApproximate string matchingTime complexityMathematics
researchProduct

Irredundant tandem motifs

2014

Eliminating the possible redundancy from a set of candidate motifs occurring in an input string is fundamental in many applications. The existing techniques proposed to extract irredundant motifs are not suitable when the motifs to search for are structured, i.e., they are made of two (or several) subwords that co-occur in a text string s of length n. The main effort of this work is studying and characterizing a compact class of tandem motifs, that is, pairs of substrings {m1, m2} occurring in tandem within a maximum distance of d symbols in s, where d is an integer constant given in input. To this aim, we first introduce the concept of maximality, related to four specific conditions that h…

CombinatoricsDiscrete mathematicsMotifs Tandem Patterns Irredundant motifs String algorithm Suffix treeGeneral Computer ScienceTandemlawSuffix treeText stringSubstringTheoretical Computer ScienceLinear numberMathematicslaw.inventionTheoretical Computer Science
researchProduct

New expressions for string loop amplitudes leading to an ultrasimple conception of string dynamics

1991

New expressions are derived for string loop amplitudes as overlap integrals of string wave functionals. They are shown to take the form of exchange terms coming from the Bose-Einstein symmetrization between string segments. One is thus led to the ultrasimple conception that string theory is basically free, and that ``string interactions'' are merely due to the fact that strings are composite objects with Bose-Einstein segments as constituents.

Condensed Matter::Quantum GasesPhysicsFísicaString field theoryType I string theoryString theoryRelationship between string theory and quantum field theoryHigh Energy Physics::TheoryDomain wall (string theory)Non-critical string theoryClassical mechanicsSymmetrizationString dualityPhysical Review D
researchProduct

Solitons and their observable signatures in quasi-one-dimensional systems

2005

We give an overview of the experimental signatures of nonlinear waves: notably topological and non topological solitons, in specific quasi-one-dimensional devices and condensed matter systems. Non topological solitons can be easily observed and manipulated, on a macroscopic scale, in optical fibers and electrical transmission lines. Topological solitons have been clearly identified as fluxons in Josephson transmission lines and as domain walls in condensed matter systems such as magnetic chains and synthetic polymers. By contrast, at the present time the observable signatures of nonlinear excitations such as pulse or envelope solitons and polarons, which are predicted to occur on a microsco…

Condensed Matter::Quantum GasesPhysicsNonlinear systemDomain wall (string theory)Condensed matter physicsMacroscopic scaleObservablePolaronNonlinear Sciences::Pattern Formation and SolitonsMicroscopic scaleEnvelope (waves)Pulse (physics)
researchProduct

Two-view “cylindrical decomposition” of binary images

2001

This paper describes the discrete cylindrical algebraic decomposition (DCAD) construction along two orthogonal views of binary images. The combination of two information is used to avoid ambiguities for image recognition purposes. This algorithm associates an object connectivity graph to each connected component, allowing a complete description of the structuring information. Moreover, an easy and compact representation of the scene is achieved by using strings in a five letter alphabet. Examples on complex digital images are also provided. © 2001 Elsevier Science Inc.

Connected componentNumerical AnalysisAlgebra and Number TheoryTheoretical computer scienceSettore INF/01 - InformaticaBinary imageObject (computer science)StructuringCylindrical algebraic decompositionString representationDigital imageImage decompositionComputer Science::Computer Vision and Pattern RecognitionDecomposition (computer science)Discrete Mathematics and CombinatoricsGeometry and TopologyRepresentation (mathematics)AlgorithmShape descriptionMathematicsLinear Algebra and its Applications
researchProduct